Scalable parallel list ranking of image edges on fine-grained machines
نویسندگان
چکیده
We present analytical and experimental results for ne-grained list ranking algorithms, with the objective of examining how the locality properties of image edge lists can be used to improve the performance of this highly data-dependent operation. Starting with Wyl-lie's algorithm and Anderson & Miller's randomized algorithm as bases, we use the spatial locality of edge links to derive scalable algorithms designed to exploit the characteristics of image edges. Tested on actual and synthetic edge data, this approach achieves significant speedup on the MasPar MP-1 and MP-2, compared to the standard list ranking algorithms. The modiied algorithms exhibit good scalability and are robust across a wide variety of images.
منابع مشابه
Scalable Parallel Implementations of List Ranking on Fine-Grained Machines
We present analytical and experimental results for ne-grained list ranking algorithms. We compare the scalability of two representative algorithms on random lists, then address the question of how the locality properties of image edge lists can be used to improve the performance of this highly data-dependent operation. Starting with Wyllie's algorithm and Anderson & Miller's randomized algorith...
متن کاملScalable data parallel algorithms for texture synthesis using Gibbs random fields
This article introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov random field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. The use of fine-grained, data parallel processing techniques yields re...
متن کاملScalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields
This paper introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov Random Field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. Use of ne-grained, data parallel processing techniques yields real-time ...
متن کاملContour ranking on coarse grained machines: a case study for low-level vision computations
In this paper we present parallel solutions for performing image contour ranking on coarse-grained machines. In contour ranking, a linear representations of the edge contours is generated from the raw image. We describe solutions that employ different divide-andconquer approaches and that use different communication patterns. The combining step of the divide-and-conquer solutions uses efficient...
متن کاملEecient P Arallel Graph Algorithms for Coarse Grained Multicomputers and Bsp ?
In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CGM) and bulk-synchronous parallel computer (BSP) models which solve the following well known graph problems: (1) list ranking, (2) Euler tour construction, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995